On Gaussian Quadrature Formulas for the Chebyshev Weight
نویسندگان
چکیده
منابع مشابه
On computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملAnti-Gaussian quadrature formulas
An anti-Gaussian quadrature formula is an (n+ 1)-point formula of degree 2n− 1 which integrates polynomials of degree up to 2n+ 1 with an error equal in magnitude but of opposite sign to that of the n-point Gaussian formula. Its intended application is to estimate the error incurred in Gaussian integration by halving the difference between the results obtained from the two formulas. We show tha...
متن کاملOn the Remainder of Gaussian Quadrature Formulas for Bernstein-szegö Weight Functions
We give an explicit expression for the kernel of the error functional for Gaussian quadrature formulas with respect to weight functions of BernsteinSzegö type, i.e., weight functions of the form (1 x)"(l + x)ß /p(x), x e (-1, 1), where a, ß £ {-\,\} and p is a polynomial of arbitrary degree which is positive on [-1, 1]. With the help of this result the norm of the error functional can easily be...
متن کاملStopping functionals for Gaussian quadrature formulas
Gaussian formulas are among the most often used quadrature formulas in practice. In this survey, an overview is given on stopping functionals for Gaussian formulas which are of the same type as quadrature formulas, i.e., linear combinations of function evaluations. In particular, methods based on extended formulas like the important Gauss-Kronrod and Patterson schemes, and methods which are bas...
متن کاملNumerical Construction of Gaussian Quadrature Formulas for
Most nonclassical Gaussian quadrature rules are difficult to construct because of the loss of significant digits during the generation of the associated orthogonal polynomials. But, in some particular cases, it is possible to develop stable algorithms. This is true for at least two well-known integrals, namely ¡l-(Loêx)-x°f(x)dx and ¡Ô Em(x)f(x)-dx. A new approach is presented, which makes use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1999
ISSN: 0021-9045
DOI: 10.1006/jath.1998.3284